Estimating the Size of the Transitive Closure in Linear Time
نویسنده
چکیده
Computing transitive closure and reachability information in directed graphs is a fundamental graph problem with many applications. The fastest known algorithms run in O(sm) time for computing all nodes reachable from each of 1 <_ s 5 n source nodes, or, using fast matrix multiplication, in O(n2.38) time for computing the transitive closure, where n is the number of nodes and m the number of edges in the graph. In query optimization in database applications it is often the case that only estimates on the size of the transitive closure and on the number of nodes reachable from certain nodes are needed. We present an O(m) time randomized algorithm that estimate: the number of nodes reachable from every node and the size of the transitive closure. We also obtain a O(m) time-algorithm for estimating sizes of neighborhoods in directed graphs with nonnegative weights, avoiding the O(mn) time bound of explicitly computing these neighborhoods. Our size-estimation algorithms are much faster than performing the actual computations and improve significantly over previous estimation methods.
منابع مشابه
Estimating the Size of Generalized Transitive Closures
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size of the transitive closure and generalizations of the transitive closure, and also show that for bounded degree relations, the algorithm runs in linear time. Such estimating algorithms are essential if database systems...
متن کاملThe Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملSize-Estimation Framework with Applications to Transitive Closure and Reachability
Computing the transitive closure in directed graphs is a fundamental graph problem. We consider the more restricted problem of computing the number of nodes reachable from every node and the size of the transitive closure. The fastest known transitive closure algorithms run in O(min{mn, n2.38}) time, where n is the number of nodes and m the number of edges in the graph. We present an O(m) time ...
متن کاملOn Estimating Path Aggregates over Streaming Graphs
We consider the updatable streaming graph model, where edges of a graph arrive or depart in arbitrary sequence and are processed in an online fashion using sub-linear space and time. We study the problem of estimating aggregate path metrics Pk defined as the number of pairs of vertices that have a simple path between them of length k. For a streaming undirected graph with n vertices, m edges an...
متن کاملFully Dynamic Transitive Closure in Plane Dags with One Source and One Sink
We give an algorithm for the Dynamic Transitive Closure Problem for planar directed acyclic graphs with one source and one sink. The graph can be updated in logarithmic time under arbitrary edge insertions and deletions that preserve the embedding. Queries of the form ‘is there a directed path from u to v?’ for arbitrary vertices u and v can be answered in logarithmic time. The size of the data...
متن کامل